Nondeterminism and infinite computations in constraint programming
نویسندگان
چکیده
منابع مشابه
Constraint Programming on Infinite Data Streams
Classical constraint satisfaction problems (CSPs) are commonly defined on finite domains. In real life, constrained variables can evolve over time. A variable can actually take an infinite sequence of values over discrete time points. In this paper, we propose constraint programming on infinite data streams, which provides a natural way to model constrained time-varying problems. In our framewo...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملInfinite Arrays and Infinite Computations
A complete metric ttipology is introduced on the set of :il finite and infinite arrays and the topological properties of the space are studied. In this complete metric topolor,y, infinite arrays are the limits of increasing sequences of finite arrays. The n.>tion of successful infinite derivations in Generalized Context-free Kolam Array Grammars, yielding infinif e arrays, is introduced. This c...
متن کاملTeaching Nondeterminism Through Programming
Nondeterminism (ND) is a fundamental concept in computer science, and comes in two main flavors. One is the kind of ND that appears in automata theory and formal languages, and is the one that students are usually introduced to. It is known to be hard to teach. We present here a study, in which we introduced students to the second kind of ND, which we term operative. This kind of ND is quite di...
متن کاملTowards Practical Infinite Stream Constraint Programming: Applications and Implementation
Siu et al. propose stream CSPs (St-CSPs) as a generalisation of finite domain CSPs to cater for constraints on infinite streams, and a solving algorithm that produces a deterministic Büchi automaton recognising the solution language. As a novel application, we demonstrate how St-CSPs can model mathematically and generate a PID controller for driving a self-balancing tray and an inverted pendulu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00047-z